A constrained conjugate gradient method for solving the magnetic field boundary integral equation

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Global conjugate gradient method for solving large general Sylvester matrix equation

In this paper, an iterative method is proposed for solving large general Sylvester matrix equation $AXB+CXD = E$, where $A in R^{ntimes n}$ , $C in R^{ntimes n}$ , $B in R^{stimes s}$ and  $D in R^{stimes s}$ are given matrices and $X in R^{stimes s}$  is the unknown matrix. We present a global conjugate gradient (GL-CG) algo- rithm for solving linear system of equations with multiple right-han...

متن کامل

A Numerical Method for Solving Stochastic Volterra-Fredholm Integral Equation

In this paper, we propose a numerical method based on the generalized hat functions (GHFs) and improved hat functions (IHFs) to find numerical solutions for stochastic Volterra-Fredholm integral equation. To do so, all known and unknown functions are expanded in terms of basic functions and replaced in the original equation. The operational matrices of both basic functions are calculated and em...

متن کامل

A Fast Fourier-Galerkin Method Solving a Boundary Integral Equation for the Biharmonic Equation

s of IWANASP, October 22 – 24, 2015, Lagos, Portugal A FAST FOURIER–GALERKIN METHOD SOLVING A BOUNDARY INTEGRAL EQUATION FOR THE BIHARMONIC EQUATION

متن کامل

On the hybrid conjugate gradient method for solving fuzzy optimization problem

In this paper we consider a constrained optimization problem where the objectives are fuzzy functions (fuzzy-valued functions). Fuzzy constrained Optimization (FO) problem plays an important role in many fields, including mathematics, engineering, statistics and so on. In the other side, in the real situations, it is important to know how may obtain its numerical solution of a given interesting...

متن کامل

global conjugate gradient method for solving large general sylvester matrix equation

in this paper, an iterative method is proposed for solving large general sylvester matrix equation $axb+cxd = e$, where $a in r^{ntimes n}$ , $c in r^{ntimes n}$ , $b in r^{stimes s}$ and  $d in r^{stimes s}$ are given matrices and $x in r^{stimes s}$  is the unknown matrix. we present a global conjugate gradient (gl-cg) algo- rithm for solving linear system of equations with multiple right-han...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Antennas and Propagation

سال: 2003

ISSN: 0018-926X

DOI: 10.1109/tap.2003.812275